Free products arising from elements of finite order in simple rings
نویسندگان
چکیده
منابع مشابه
Finite field elements of high order arising from modular curves
In this paper, we recursively construct explicit elements of provably high order in finite fields. We do this using the recursive formulas developed by Elkies to describe explicit modular towers. In particular, we give two explicit constructions based on two examples of his formulas and demonstrate that the resulting elements have high order. Between the two constructions, we are able to genera...
متن کاملOn constant products of elements in skew polynomial rings
Let $R$ be a reversible ring which is $alpha$-compatible for an endomorphism $alpha$ of $R$ and $f(X)=a_0+a_1X+cdots+a_nX^n$ be a nonzero skew polynomial in $R[X;alpha]$. It is proved that if there exists a nonzero skew polynomial $g(X)=b_0+b_1X+cdots+b_mX^m$ in $R[X;alpha]$ such that $g(X)f(X)=c$ is a constant in $R$, then $b_0a_0=c$ and there exist nonzero elements $a$ and $r$ in $R$ such tha...
متن کاملSimple Polytopes Arising From Finite Graphs
Let G be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate G with the edge polytope PG and the toric ideal IG. By classifying graphs whose edge polytope is simple, it is proved that the toric ideals IG of G possesses a quadratic Gröbner basis if the edge polytope PG of G is simple. It is also shown that, for a finite graph G, the edge polytope is simple...
متن کاملFinite Field Elements of High Order Arising from Modular Curves (appeared in Designs, Codes, and Cryptography )
In this paper, we recursively construct explicit elements of provably high order in finite fields. We do this using the recursive formulas developed by Elkies to describe explicit modular towers. In particular, we give two explicit constructions based on two examples of his formulas and demonstrate that the resulting elements have high order. Between the two constructions, we are able to genera...
متن کاملDepth of Edge Rings Arising from Finite Graphs
Let G be a finite graph and K[G] the edge ring of G. Based on the technique of Gröbner bases and initial ideals, it will be proved that, given integers f and d with 7 ≤ f ≤ d, there exists a finite graphG on [d] = {1, . . . , d} with depthK[G] = f and with Krull-dimK[G] = d.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2005
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-05-07764-6